Locality-sensitive hashing

Results: 117



#Item
51indexing_cvpr2011_camready.pdf

indexing_cvpr2011_camready.pdf

Add to Reading List

Source URL: vision.stanford.edu

Language: English - Date: 2011-04-10 02:35:16
52The Power of Asymmetry in Binary Hashing  Behnam Neyshabur Payman Yadollahpour Yury Makarychev Toyota Technological Institute at Chicago

The Power of Asymmetry in Binary Hashing Behnam Neyshabur Payman Yadollahpour Yury Makarychev Toyota Technological Institute at Chicago

Add to Reading List

Source URL: papers.nips.cc

Language: English - Date: 2014-11-26 14:29:25
53Fast Tweet Retrieval with Compact Binary Codes Weiwei Guo∗ Wei Liu† Mona Diab‡ Computer Science Department, Columbia University, New York, NY, USA † IBM T. J. Watson Research Center, Yorktown Heights, NY, USA ‡

Fast Tweet Retrieval with Compact Binary Codes Weiwei Guo∗ Wei Liu† Mona Diab‡ Computer Science Department, Columbia University, New York, NY, USA † IBM T. J. Watson Research Center, Yorktown Heights, NY, USA ‡

Add to Reading List

Source URL: anthology.aclweb.org

Language: English - Date: 2014-08-08 12:20:25
54Similarity Estimation Techniques from Rounding Algorithms Moses S. Charikar Dept. of Computer Science Princeton University 35 Olden Street

Similarity Estimation Techniques from Rounding Algorithms Moses S. Charikar Dept. of Computer Science Princeton University 35 Olden Street

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2004-02-04 10:27:32
55Microsoft PowerPoint - mmds

Microsoft PowerPoint - mmds

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2006-10-15 22:45:52
561  Introduction Gregory Shakhnarovich, Piotr Indyk, and Trevor Darrell  The nearest-neighbor (NN) problem occurs in the literature under many

1 Introduction Gregory Shakhnarovich, Piotr Indyk, and Trevor Darrell The nearest-neighbor (NN) problem occurs in the literature under many

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2006-03-03 12:41:25
57Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

Add to Reading List

Source URL: www.mmds.org

Language: English - Date: 2014-08-11 14:11:58
58Nearest Neighbor Search in high-dimensional spaces Alexandr Andoni (Princeton/CCI → MSR SVC) Barriers II August 30, 2010

Nearest Neighbor Search in high-dimensional spaces Alexandr Andoni (Princeton/CCI → MSR SVC) Barriers II August 30, 2010

Add to Reading List

Source URL: www.mit.edu

Language: English - Date: 2010-09-04 11:51:32
59Mining of Massive Datasets Jure Leskovec Stanford Univ.

Mining of Massive Datasets Jure Leskovec Stanford Univ.

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2015-03-01 12:52:08
60Optimal Data-Dependent Hashing for Approximate Near Neighbors Alexandr Andoni∗ † Ilya Razenshteyn∗ ‡  March 18, 2015

Optimal Data-Dependent Hashing for Approximate Near Neighbors Alexandr Andoni∗ † Ilya Razenshteyn∗ ‡ March 18, 2015

Add to Reading List

Source URL: www.ilyaraz.org

Language: English - Date: 2015-03-18 00:06:14